Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Finite state machine")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1645

  • Page / 66
Export

Selection :

  • and

Learning Finite-State Machines from Inexperienced TeachersGRINCHTEIN, Olga; LEUCKER, Martin.Lecture notes in computer science. 2006, pp 344-345, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

On chaos of digital filters in the real worldLIN, T; CHUA, L. O.IEEE transactions on circuits and systems. 1991, Vol 38, Num 5, pp 557-558, issn 0098-4094, 2 p.Article

Exact solutions for the construction of optimal length test sequencesRODRIGUES, M; URAL, H.Information processing letters. 1993, Vol 48, Num 6, pp 275-280, issn 0020-0190Article

Fault masking by multiple timing faults in timed EFSM modelsWANG, Y; UYAR, M. O; BATTH, S. S et al.Computer networks (1999). 2009, Vol 53, Num 5, pp 596-612, issn 1389-1286, 17 p.Article

State-Based Model Slicing: A SurveyANDROUTSOPOULOS, Kelly; CLARK, David; HARMAN, Mark et al.ACM computing surveys. 2013, Vol 45, Num 4, issn 0360-0300, 53.1-53.35Article

p-subsequentiable transducersALLAUZEN, Cyril; MOHRI, Mehryar.Lecture notes in computer science. 2003, pp 24-34, issn 0302-9743, isbn 3-540-40391-4, 11 p.Conference Paper

Infinite-state high-level MCS: Model-checking and realizability: (Extended abstract)GENEST, Blaise; MUSCHOLL, Anca; SEIDL, Helmut et al.Lecture notes in computer science. 2002, pp 657-668, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

Evaluating two-bit branch predictors for user/kernel codePETROVIC, M; TARTALJA, I.International conference on microelectronic. 1997, pp 827-830, isbn 0-7803-3664-X, 2VolConference Paper

Deduction on the compositions of finite-state modelsNOVORUSSKY, V.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 156-160, isbn 2-9502908-5-X, 2VolConference Paper

From xerox to aspell : A first prototype of a north sámi speller based on TWOL technologyGAUP, Børre; MOSHAGEN, Sjur; OMMA, Thomas et al.Lecture notes in computer science. 2006, pp 306-307, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, 2 p.Conference Paper

Thompson digraphs: A characterizationGIAMMARRESI, Dora; PONTY, Jean-Luc; WOOD, Derick et al.Lecture notes in computer science. 2001, pp 91-100, issn 0302-9743, isbn 3-540-42812-7Conference Paper

Deriving deadlock and unspecified reception free protocol converters from message mapping setsPEYRAVIAN, M; LEA, C.-T.Computer networks and ISDN systems. 1996, Vol 28, Num 13, pp 1831-1844, issn 0169-7552Article

Proving liveness for networks of communicating finite state machinesGOUDA, M. G; CHUNG-KUO CHANG.ACM transactions on programming languages and systems. 1986, Vol 8, Num 1, pp 154-182, issn 0164-0925Article

A Merging States Algorithm for Inference of RFSAsALVAREZ, Gloria; GARCIA, Pedro; RUIZ, José et al.Lecture notes in computer science. 2006, pp 340-341, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 2 p.Conference Paper

Closing the gap between software modelling and codeWAGNER, F; WAGNER, T; WOLSTENHOLME, P et al.IEEE international conference and workshop on the engineering of computer-based systems. 2004, pp 52-59, isbn 0-7695-2125-8, 1Vol, 8 p.Conference Paper

Testing from a finite-state machine : Extending invertibility to sequencesHIERONS, R. M.Computer journal (Print). 1997, Vol 40, Num 4, pp 220-230, issn 0010-4620Article

Finite-state methods and natural language processing (5th international workshop, FSMNLP 2005, Helsinki, Finland, September 1-2, 2005)Yli-Jyrä, Anssi; Karttunen, Lauri; Karhumäki, Juhani et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 978-3-540-35467-3, 1Vol, XIV-312 p, isbn 978-3-540-35467-3Conference Proceedings

Fault propagation by equation solvingEL-FAKIH, Khaled; YEVTUSHENKO, Nina.Lecture notes in computer science. 2004, pp 185-198, issn 0302-9743, isbn 3-540-23252-4, 14 p.Conference Paper

STRUCTURES NON-CONNEXES. GRAMMAIRE DES INCISES EN FRANÇAIS : DESCRIPTION LINGUISTIQUE ET OUTILS INFORMATIQUES = NON-CONNECTED STRUCTURES. A GRAMMAR OF INSERTS IN FRENCH : LINGUISTIC DESCRIPTION AND COMPUTER TOOLSFairon, Cédrick; Gross, Maurice.2000, 183 p.Thesis

Correction to Optimal state assignment for finite state machinesDE MICHELI, G; BRAYTON, R. K; SANGIOVANNI-VINCENTELLI, A et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1986, Vol 5, Num 1, issn 0278-0070, 239Article

Formalization of edges for the Grafcet state machineGUILLAUME, M; GRAVE, J.-M; CHLIQUE, P et al.CESA'96 IMACS Multiconference : computational engineering in systems applications. 1996, pp 579-583, isbn 2-9502908-7-6Conference Paper

Constructing checking sequences for distributed testingURAL, Hasan; WILLIAMS, Craig.Formal aspects of computing. 2006, Vol 18, Num 1, pp 84-101, issn 0934-5043, 18 p.Article

A T1 ones-density controlled band on finite-state machinesSABIN, M. J; OMURA, J. K; NIGHTINGILL, L et al.IEEE transactions on communications. 1990, Vol 38, Num 6, pp 906-914, issn 0090-6778, 9 p.Article

Retrieval in multimedia presentationsCELENTANOL, Augusto; GAGGI, Ombretta; SAPINO, Maria Luisa et al.Multimedia systems. 2004, Vol 10, Num 1, pp 72-82, issn 0942-4962, 11 p.Conference Paper

Overcoming observability problems in distributed test architecturesCHEN, J; HIERONS, R. M; URAL, H et al.Information processing letters. 2006, Vol 98, Num 5, pp 177-182, issn 0020-0190, 6 p.Article

  • Page / 66